Heuristic Optimization Algorithms in Robotics
نویسندگان
چکیده
Today, Robotic is an essential technology from the entertainment to the industry. Thousands of articles have been published on Robotic. There are various types of robots such as parallel robots, industrial robots, mobile robots, autonomous mobile robots, health-care robots, military robots, entertainment robots, nano robots and swarm robots. So, this variety brings a lot of problems in Robotic. Inverse kinematic for serial robots, forward kinematic for parallel robots, path planning for mobile robots and trajectory planning for industrial robots are some of the problems in Robotic studied a lot. Some of the problems are solved easily with some mathematical equations such as forward kinematic problem for serial robots and inverse kinematic problem for parallel robots. But the problems consisting of nonlinear equations and higher order terms can’t be solved exactly with the classical methods. The forward kinematics problem of the 6 degrees of freedom (DOF) 6x6 type of Stewart Platform can be given as an example to such problems. It has been shown that there are 40 distinct solutions for this problem (Raghavan, 1993). Some of the unsolved problems with classical methods are optimization problems and heuristic optimization techniques are an alternative way for the solution of such problems. The heuristic optimization techniques produce good solutions for the higher order nonlinear problems in an acceptable solution time, when the problems aren’t solved with the classical methods (Lee & El-Sharkawi, 2008). In this chapter, first in Section 2, optimization is shortly described. The introduction and some well-known heuristic algorithms including, Genetic Algorithms(GA), Simulated Annealing(SA), Particle Swarm Optimization(PSO) and Gravitational Search Algorithm(GSA) are reviewed in Section 3. In Section 4, two well-known optimization problems in Robotic are solved with GA and PSO.
منابع مشابه
OPTIMAL SIZE AND GEOMETRY DESIGN OF TRUSS STRUCTURES UTILIZING SEVEN META-HEURISTIC ALGORITHMS: A COMPARATIVE STUDY
Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...
متن کاملTesting Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملA comparative study of two meta-heuristic algorithms in optimizing cost of reinforced concrete segmental lining
In this work, we tried to automatically optimize the cost of the concrete segmental lining used as a support system in the case study of Mashhad Urban Railway Line 2 located in NE Iran. Two meta-heuristic optimization methods including particle swarm optimization (PSO) and imperialist competitive algorithm (ICA) were presented. The penalty function was used for unfeasible solutions, and the seg...
متن کاملOrdinal comparison of heuristic algorithms using stochastic optimization
The performance of heuristic algorithms for combinatorial optimization is often sensitive to problem instances. In extreme cases, a specialized heuristic algorithm may perform exceptionally well on a particular set of instances while fail to produce acceptable solutions on others. Such a problem-sensitive nature is most evident in algorithms for combinatorial optimization problems such as job s...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملMeta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012